翻訳と辞書 Words near each other ・ Erechthias chionodira ・ Erechthias darwini ・ Erechthias diaphora ・ Erechthias dracaenura ・ Erechthias flavistriata ・ Erechthias glyphidaula ・ Erechthias grayi ・ Erechthias kerri ・ Erechthias lychnopa ・ Erechthias minuscula ・ Erechthias molynta ・ Erechthias mystacinella ・ Erdős–Kac theorem ・ Erdős–Ko–Rado theorem ・ Erdős–Mordell inequality ・ Erdős–Nagy theorem ・ Erdős–Nicolas number ・ Erdős–Pósa theorem ・ Erdős–Rado theorem ・ Erdős–Rényi model ・ Erdős–Stone theorem ・ Erdős–Straus conjecture ・ Erdős–Szekeres theorem ・ Erdős–Szemerédi theorem ・ Erdős–Turán conjecture on additive bases ・ Erdős–Turán inequality ・ Erdős–Woods number ・ Erdőtarcsa ・ ERE ・ ERE Informatique Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Erdős–Nagy theorem ： ウィキペディア英語版 Erdős–Nagy theorem The Erdős–Nagy theorem is a result in discrete geometry stating that a non-convex simple polygon can be made into a convex polygon by a finite sequence of flips. The ''flips'' are defined by taking a convex hull of a polygon and reflecting a pocket with respect to the boundary edge. The theorem is named after mathematicians Paul Erdős and Béla Szőkefalvi-Nagy. == History == Paul Erdős conjectured the result in 1935 as a problem in the ''American Mathematical Monthly'', and Szőkefalvi-Nagy published a proof in 1939. The problem has a curious history and had been repeatedly rediscovered, until Branko Grünbaum surveyed the results in 1995. As it turns out, the original proof had a delicate mistake, which has been since corrected. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Erdős–Nagy theorem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.